A New Method of Quantifying the Complexity of Fractal Networks

There is a large body of research devoted to identifying the complexity structures in networks. In context network theory, complex graph with nontrivial topological features—features that do not occur simple networks, such as lattices or random graphs, but often graphs modeling real systems. The study networks young and active area scientific inspired largely by empirical real-world computer logistic transport Transport great importance for economic cultural cooperation any country other countries, strengthening development management system, solving social problems. Provision territory well-developed system one factors attracting population production, serving an important advantage locating productive forces providing integration effect. this paper, we introduce new method quantifying based on presenting nodes Cartesian coordinates, converting polar calculating fractal dimension using ReScaled ranged (R/S) method. Our results suggest approach can be used determine type has fixed nodes, it presents application public system.